Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching
نویسندگان
چکیده
منابع مشابه
Efficient Approximation Algorithms for Weighted b-Matching
We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we...
متن کاملDiverse Weighted Bipartite b-Matching
Bipartite matching, where agents on one side of a market are matched to agents or items on the other, is a classical problem in computer science and economics, with widespread application in healthcare, education, advertising, and general resource allocation. A practitioner’s goal is typically to maximize a matching market’s economic efficiency, possibly subject to some fairness requirements th...
متن کاملAlgorithms for Weighted Matching
We consider the matching of weighted patterns against an unweighted text. We adapt the shift-add algorithm for this problem. We also present an algorithm that enumerates all strings that produce a score higher than a given score threshold when aligned against a weighted pattern and then searches for all these strings using a standard exact multipattern algorithm. We show that both of these appr...
متن کاملMaximum Vertex-weighted Matching in Strongly Chordal Graphs
Given a graph G = (V; E) and a real weight for each vertex of G, the vertex-weight of a matching is deened to be the sum of the weights of the vertices covered by the matching. In this paper we present a linear time algorithm for nding a maximum vertex-weighted matching in a strongly chordal graph, given a strong elimination ordering. The algorithm can be specialized to nd a maximum cardinality...
متن کاملParalle Approximation Algorithms for Maximum Weighted Matching in General Graphs
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The rst is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 times the maximum for any given constant > 0. The second one is an NC approximation algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.05.032